Frobenius Additive Fast Fourier Transform

نویسندگان

  • Wen-Ding Li
  • Ming-Shing Chen
  • Po-Chun Kuo
  • Chen-Mou Cheng
  • Bo-Yin Yang
چکیده

In ISSAC 2017, van der Hoeven and Larrieu showed that evaluating a polynomial P ∈ Fq [x] of degree < n at all n-th roots of unity in Fqd can essentially be computed d-time faster than evaluating Q ∈ Fqd [x] at all these roots, assuming Fqd contains a primitive n-th root of unity [vdHL17a]. Termed the Frobenius FFT, this discovery has a profound impact on polynomial multiplication, especially for multiplying binary polynomials, which finds ample application in coding theory and cryptography. In this paper, we show that the theory of Frobenius FFT beautifully generalizes to a class of additive FFT developed by Cantor and Gao-Mateer [Can89, GM10]. Furthermore, we demonstrate the power of Frobenius additive FFT for q = 2: to multiply two binary polynomials whose product is of degree < 256, the new technique requires only 29,005 bit operations, while the best result previously reported was 33,397. To the best of our knowledge, this is the first time that FFT-based multiplication outperforms Karatsuba and the like at such a low degree in terms of bit-operation count.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform

We show a new algorithm and its implementation for multiplying bitpolynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order element under Frobenius map of F2. With the high order element, we can derive more values of the polynomials under Frobenius map. Besides, we also adapt the ad...

متن کامل

The Frobenius FFT

Let Fq be the finite field with q elements and let ! be a primitive n-th root of unity in an extension eld Fqd of Fq. Given a polynomial P 2 Fq[x] of degree less than n, we will show that its discrete Fourier transform (P (1); P (!); :::; P (!n¡1)) 2Fqd n can be computed essentially d times faster than the discrete Fourier transform of a polynomial Q 2 Fqd[x] of degree less than n, in many case...

متن کامل

Fourier transform algorithms for pricing and hedging discretely sampled exotic variance products and volatility derivatives under additive processes

We develop efficient fast Fourier transform algorithms for pricing and hedging discretely sampled variance products and volatility derivatives under additive processes (time-inhomogeneous Lévy processes). Our numerical algorithms are non-trivial versions of the Fourier space time stepping method to nonlinear path dependent payoff structures, like those in variance products and volatility deriva...

متن کامل

Robust MFCCs Derived from Differentiated Power Spectrum

The mel-scaled frequency cepstral coefficients (MFCCs) derived from Fourier transform and filter bank analysis are perhaps the most widely used front-ends in state-of-the-art speech recognition systems. One of the major issues with the MFCCs is that they are very sensitive to additive noise. To improve the robustness of speech front-ends with respect to noise, we introduce, in this paper, a new...

متن کامل

Fourier-reflexive partitions and MacWilliams identities for additive codes

A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition coincides the primal partition. Such partitions permit MacWilliams identities for the partition enumerators of additive codes. It is shown that dualization c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1802.03932  شماره 

صفحات  -

تاریخ انتشار 2018